A Non-shared Binding Scheme for Parallel Prolog Implementation
نویسندگان
چکیده
To al low eff icient parallel processing of Prolog programs on distributed multiprocessors, a non-shared variable binding approach is required such that binding environments can be independently distributed among processors. This paper presents a binding scheme, which realises the independence of a clause's binding environment by eagerly instantiating variables across clause arguments. The application of the scheme on a Prolog virtual machine has illustrated its features of e f f i c iency in execut ion and s imp l i c i t y in implementat ion. The prel iminary performance evaluation has demonstrated the feasibility of the scheme.
منابع مشابه
Optimal Implementation of And-Or Parallel Prology
Most models that have been proposed, or implemented, so far for exploiting both or-parallelism and independent and-parallelism have only considered pure logic programs (pure Prolog). We present an abstract model, called the Composition-Tree, for representing and-or parallelism in full Prolog. The Composition-Tree recomputes independent goals to ensure that Prolog semantics is preserved. We comb...
متن کاملOr-Parallel Prolog on a Distributed Memory Architecture
Whilst there has been much work over the last ten years on the parallel implementation of logic programming, the vast majority of it has been focused on shared memory multiprocessor systems. In this paper, however, we focus on the exploitation of the other major type of parallel architecture-distributed memory systems. We present the design and study the performance of the Dorpp or-parallel Pro...
متن کاملPALS: Efficient Or-Parallel execution of Prolog on Beowulf clusters
This paper describes the development of the PALS system, an implementation of Prolog capable of efficiently exploiting or-parallelism on distributed-memory platforms— specifically Beowulf clusters. PALS makes use of a novel technique, called incremental stack-splitting. The technique proposed builds on the stack-splitting approach, previously described by the authors and experimentally validate...
متن کاملReform Prolog: The Language and Its Implementation
Reform Prolog is an (dependent) AND-parallel system based on recursion-parallelism and Reform compilation. The system supports selective, user-declared, parallelization of binding-deterministic Prolog programs (nondeter-minism local to each parallel process is allowed). The implementation extends a convential Prolog machine with support for data sharing and process managment. Extensive global d...
متن کاملAnalysis and Improvement of the Variable Binding Scheme in LOGFLOW*
The handling of variables is a crucial issue in designing a parallel Prolog system. The so called closed binding environment is an excellent candidate for a binding scheme in a distributed system, however, it has several weaknesses when the computation is not migrating. In this paper the closed binding method is analysed, a possible modification is introduced and the implementation and performa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991